An LFG Grammar Checker for CALL
نویسندگان
چکیده
In this paper we present the possibilities of modifying an existing broad-coverage LFG for German in such a way that it can be used as a grammar checker in L2 learning that not only states whether or not the learner's input is grammatical, but also provides crucial information necessary for generating helpful feedback as to what has to be corrected. The necessary modifications, which consist basically in anticipating malrules, are exemplified with a number of notorious systematic errors L2 learners of German typically commit, such as the non-compliance of constraints on verb placement, the use of pragmatically inadequate constituent orders and agreement violations. At present, the modified grammar covers the most frequent error types of L2 learners. However, more corpus work is needed for extension and evaluation.
منابع مشابه
LFG Generation by Grammar Specialization
This article describes an approach to Lexical-Functional Grammar (LFG) generation that is based on the fact that the set of strings that an LFG grammar relates to a particular acyclic f-structure is a context-free language. We present an algorithm that produces for an arbitrary LFG grammar and an arbitrary acyclic input f-structure a context-free grammar describing exactly the set of strings th...
متن کاملEvaluating Two Web-based Grammar Checkers-Microsoft ESL Assistant and NTNU Statistical Grammar Checker
Many ESL students need to improve writing skills to pass various language tests; thus, writing teachers need to read many compositions and provide feedback. To help ESL teachers reduce their teaching load and to give students faster feedback, various English grammar checkers have been developed. Few of these PC-based grammar checkers, however, are widely available to ESL learners. As the Intern...
متن کاملAutomating the Generation of a Wide-coverage LFG for French using a MetaGrammar
In this paper, we explain how the notion of MetaGrammar, which has successfully been used for generating wide-coverage tree adjoining grammars (TAGs) for various languages such as French (Abeillé et al. (1999)) and German (Gerdes (2002)), may be used to generate a wide-coverage Lexical Functional Grammar (LFG) for French. We first introduce the notion of MetaGrammar and present the tools we use...
متن کاملXLFG-an LFG parsing scheme for French
We present XLFG, a new parser for LFG developed by Lionel Clément (Clément 2000), (Clément 2001b). This parser is freely available for pedagogical as well as for research purpose. In this paper, we explain how the tool has been used to develop and evaluate a medium-size LFG for French. We also show how we have exploited the similarities between the LFG and the Tree Adjoining Grammar Frameworks ...
متن کاملA Broad-coverage, Representationally Minimal Lfg Parser: Chunks and F-structures Are Sufficient
Amajor reason why LFG employs c-structure is because it is context-free. According to Tree-Adjoining Grammar (TAG), the only context-sensitive operation that is needed to express natural language is Adjoining, from which LFG functional uncertainty has been shown to follow. Functional uncertainty, which is expressed on the level of f-structure, would then be the only extension needed to an other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004